Sheaf data model

ABSTRACT

A data model including a first table to represent an entity type with a column in the table for a respective attribute of the entity type, and having rows entered with attribute data. The data model also includes a row graph which represents an ordering relationship between the rows of the first table, and a column graph which represents an ordering relationship between columns of the first table. Further, the column graph is a row graph from a second table.

This application claims priority of provisional application Ser. No.60/203,945 Filed May 12, 2000

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH

The present invention was made in part with U.S. Government support as asubcontractor with Lawrence Livermore National Lab (LLNL) under contractto DOE. The LLNL contract number is “Prime Contract No. W-7405 ENG 48”and the subcontractor contract number is B347785. The U.S. Governmenthas certain rights in the invention.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a data model and associated operators.More particularly, the present invention relates to a sheaf data modelincluding a base set and a corresponding graph representing theinclusions of the base set, and associated operators which operate onthe sheaf data model.

2. Discussion of the Background

A data model is a theory for describing computer data. The term wasintroduced by C. F. Codd in the early 1970's to describe therelationship between previous approaches to data management and arelational data model which he had just introduced. Formally, a datamodel specifies three things: 1) a class of mathematical objects whichare used to model data; 2) the operations on those objects; and 3) theconstraints between the objects that must be satisfied in a validdatabase.

The purpose of a data model is to serve as a basis for analysis, design,and implementation of database management systems (DBMS). That is, aDBMS will implement in software (or sometimes in hardware) theoperations of the model which allow clients of the system to store andmanipulate their data as instances of the objects of the model.

Currently all major DBMS', such as the ones sold under the trademarksORACLE, INFORMIX and SYBASE, are based on some form of the relationalmodel. To the commercial data management industry, data management isessentially indistinguishable from relational database management system(RDBMS) technology.

In the relational data model, the mathematical objects are relations ondomains and the operations are given by relational algebra. The termsrelation, domain and relational algebra have detailed, rigorousdefinitions in mathematics. However, it is possible to understand theseterms via a widely used table analogy, and which will be described withreference to the tables shown in FIGS. 1 a-1 c and 2 a-2 g.

A mathematical set is any collection of objects, entities, etc. A domainis a set of values that can be directly represented on the computer, inother words a computer data type. Three very common domains are integernumbers, real numbers, and character strings. Referring to FIG. 1 a, adomain 7 is a table 8 with a single column 17 listing all possiblevalues 9 in the domain 7. A name 11 of the domain 7 is a column heading.The number of values in the domain 7 has been selected to be very smallto make the table easy to draw, however, in practice the number ofvalues is much larger.

FIG. 1 b illustrates a table 10 representing a binary Cartesian productof two sets A and B. The table 10 includes all possible pairs (a,b),where a is a member of set A and b is a member of set B. As shown, thetable 10 includes two columns 13 and 15, one for set A and one for setB. FIG. 1 b shows the Cartesian product of the domain TINY_INT withitself. Each row in the table 10 includes a pair of values and hencecorresponds to a member of the Cartesian product set. Each column 13, 15corresponds to one of the factors in the product.

In addition, the Cartesian product can be extended to more than just twofactors. The n-ary Cartesian product A×B×C× . . . (n factor sets) is atable with n columns, one for each factor. Each row contains n values,one from each one of the factors. In addition, there is a row in thetable for each possible combination of values. Each row is called ann-tuple and the n-ary Cartesian product is the set of all such n-tuples.

FIG. 1 c illustrates a table 12, which is subset of a Cartesian productset shown in table 10 (see FIG. 1 b). Table 12 is a relation andincludes the same column headings as table 10. However, table 12includes only some of the rows of table 10. Thus, table 12 is referredto as a relation, because a subset is selected to represent all thepairs satisfying a predetermined relationship between the two columns 13and 15. In more detail, FIG. 1 c illustrates the relationLESS-THAN-OR-EQUAL in which the value in column 13 of a given row isless than or equal to the value in column 15 of the same row.

A relation schema or relation type is a list of column headings for thetable or equivalently a list of factors in the Cartesian product whichthe relation is a subset of. There are many different possible subsetsof the rows of a given Cartesian product set and hence there are manypossible relations for a given relation type. The term “relationinstance” is used to refer to a specific subset of the rows of a givenrelation type.

Applications are often analyzed for data base purposes using the dualnotions of entity and relationship. An entity is any thing or object inthe real world which is distinguishable from all other objects. Entitieshave attributes. An attribute is a named property that takes its valuefrom some domain. An entity is represented by its set of attributevalues and the attribute values identify the entity and describe itsstate. A relationship is an association between entities.

When the relational model is used to store application data, theapplication data is typically organized so that a relation representseither an entity in the application or a relationship between entities.FIGS. 2 a-2 g illustrate an example of a relational model directed to apersonnel application including an EMPLOYEE table 14 and a MANAGED_BYtable 24 (see FIGS. 2 a and 2 b). The EMPLOYEE table 14 shown in FIG. 2a is an entity table. Each row in table 14 represents an entity (i.e.,an employee) and the columns in table 14 represent attributes of theentity (i.e., an employee_id 16, name 18, job title 20, and salary 22).

The MANAGED_BY table 24 shown in FIG. 2 b is a relation corresponding toa relationship between workers and managers. That is, each row in table24 represents a relationship between two employees, one a manager of theother. The columns in table 24 include the ids 16 of the relevantemployees and a manager_id 26.

In addition, because an entity is any thing or object, an attributevalue can also be considered as an entity. For example, a name servingas an attribute value of an entity EMPLOYEE may also be considered anentity. Thus, an entity-attribute association can be considered as arelationship between two entities, a primary entity and the attributeentity. This fundamental relationship is referred to as a HAS_Arelationship, which is built into the relational data model. That is,the HAS_A relationship is directly represented by the relationshipbetween a table and its columns. Other relationships, such as theMANAGED_BY relationship shown in FIG. 2 b, must be represented byadditional tables.

Further, a large number of operations may be performed on relations. Theoperations receive one or more relations (i.e., tables) as an input andproduce a relation as an output. The operations are not all independentof each other. That is, some operations can be implemented using otheroperations. Six fundamental operators in the relational algebrainclude: 1) Cartesian product, 2) selection, 3) projection, 4) union, 5)intersection, and 6) rename. The Cartesian product operator has beendiscussed with reference to FIG. 1 b. A description of the other fiveoperators will now be given with reference to FIGS. 2 c-2 f.

The selection operator receives a table (i.e., a relation) and a rowselection condition as an input and outputs a table containing only therows that match the selection condition. For example, the command“SELECT rows with SALARY>=$100,000 in relation EMPLOYEE” returns a table28 shown in FIG. 2 c. Note the table 28 in FIG. 2 c does not have aname. The rename operator (discussed below) allows a table to be named.However, in some instances the table produced by an operator is atemporary result to be used only as input to another operator. In theseinstances there is no need for the table to have a name.

Another result of a selection operation is shown in FIG. 2 d, in whichthe command “SELECT rows with TITLE=Programmer in relation EMPLOYEE” isexecuted. As shown, the resulting table 30 includes only the rows withthe title “Programmer.”

The projection operator is similar to the selection operator, except itworks on columns. That is, the projection operator receives a table anda column selection condition, typically a list of column names as aninput and outputs a table including only the selected columns. Inaddition, because two rows may have a different attribute only in acolumn not selected by the projection operation, the resulting table mayinclude duplicate rows. In this instance, only one of the duplicate rowsis retained, and the others are discarded. FIG. 2 e illustrates a resultof the projection operation, in which the command “PROJECT columns namedNAME in relation EMPLOYEE” is executed. As shown, the projectionoperation produces a table 32 including all of the employees' names.

The union operator receives two tables as an input and outputs a tableincluding all the rows in either of the input tables. In addition, theunion operator can only be used on tables which both have the samerelation type (column headings). For example, FIG. 2 f illustrates aresultant table 34 from a union operator of the tables shown in FIGS. 2c and 2 d. The table 34 is produced by executing the command “UNIONrelation Table 6 with relation Table 7.” The references to Tables 6 and7 respectively refer to the tables shown in FIGS. 2 c and 2 d.

The intersection operator receives two tables as an input and outputs atable containing all rows that were the same in both tables. Similar tothe union operator, the intersection operator can be only used on tableswhich both have the same relation type. For example, FIG. 2 gillustrates a resultant table 36 from an intersection operation of thetables shown in FIGS. 2 c and 2 d, in which the command “INTERSECTrelation Table 6 with relation to Table 7” is executed.

The above-noted operators all produce nameless tables. However, a tablemust have a name if it is to be later referred to. The rename operatormay be executed to perform this function.

The set of operators described above is a primitive set of operators.That is, the set is a minimal set of operations from which other moreconvenient operations can be built. Practical relational databasesystems implement a number of other operators, which for simplicitypurposes are not described herein.

A database for a particular application is designed by choosing a set ofrelation types that represent the entities and relationships in theapplication. This collection of relation types is called the databaseschema. The details of the mathematics of the relation model place anumber of constraints on the relation types in the database schema. Adatabase schema that satisfies these constraints is said to be in normalform and the process of reshaping a candidate database schema design tomeet the requirements of the normal form is called normalization. Thenet effect of normalization is typically to scatter the attributes of anentity across many different tables.

The constraints of the normal form are organized into various stages,such as first normal form, second normal form, etc. The first normalform requires each column in a table to contain atomic data. That is,the domain associated with the column must be some predefined,preferably fixed size type value such as an integer. The reason for thisis because the relational operations deal only with the table structureand can not deal with any internal structure associated with the datawithin a given cell in the table.

The most infamous type of non-atomic data is the array. Frequently, themost natural interpretation of the application entity is it has anattribute which is a variable length collection. For instance, anattribute for an employee might be “skills,” a variable length array ofskill keywords. However, this attribute would constitute a non-atomicattribute and hence is forbidden. Typically, the atomic attributerequirement forces the creation of additional tables, such as anEMPLOYEE_SKILLS table, which would cross-reference other employeeentities to skill entities. In many applications this is an entirelyacceptable approach. However, in several instances (discussed below)this type of processing is unacceptable.

The relational data model was a radical departure from previous datamanagement approaches because it is a mathematical model. Previous adhoc approaches had mostly focused on how data was to be stored anddescribed how to access the data in terms of how it was stored. Thislimited the types of queries that could be made and generated massivesoftware maintenance problems whenever the data storage was reorganized.

The relational data model instead described data in terms of abstractmathematical objects and operations. The mathematical abstractionseparated how data was accessed from how it was actually stored.Furthermore, the mathematics ensured that the relational algebra was acomplete set of query operators. That is, any query within the universeof possible queries defined by the model could be generated by asuitable combination of the fundamental relational algebra operators.

The mathematical abstraction and completeness of the relational algebrameant that sophisticated query processors could be implemented asindependent subsystems, without knowledge of the application. Thisarguably created the database management system as a commercial productand unquestionably revolutionized the database industry.

In spite of the overwhelming success of the relational data model, notall application areas are well served by the model. A first applicationwhich is not well suited for the relational model is an applicationwhich deals with spatial data. There are a wide variety of applicationsusing data that is spatial or geometric in nature. For example, computeraided design and manufacturing (CAD/CAM) and geographic informationsystems (GIS) are two well known commercially important examples.

A main focus of systems that deal with spatial data is the need torepresent spatial decomposition. For example, in design data, thedecomposition into systems, subsystems, and parts is a spatialdecomposition. Similarly, in geographical data, the decomposition intostates, counties, and cities is a spatial decomposition. Furthermore,these applications frequently exhibit multiple, concurrentdecompositions. For instance, geographic systems must represent bothphysical boundaries and political boundaries.

At the finest level of decomposition, spatial data includes collectionsof geometric primitives and the topological relationships between theprimitives. Geometric primitives include simple geometric shapes likepoints, lines and polygons, as well as a wide and constantly growingnumber of mathematically more sophisticated primitives, such asnon-uniform-rational-B-splines n (NURBS). The topological relationshipsdescribe how these geometric patches are connected to form complexstructures.

It has long been understood that the relational model is a poor choicefor representing spatial data. There are at least two fundamentalissues. First, it is difficult to represent the decompositionrelationships, especially the topological relationships, in a naturaland efficient way. For instance, a polygon has a collection of edges(i.e., a HAS_A relationship) which is naturally represented as anattribute of the polygon entity. However, the first normal formprohibits such variable length collections as attributes. On the otherhand, representing the topological relationships in separaterelationship tables requires complex, possibly recursive, and frequentlyinefficient queries to retrieve all the parts of a geometric primitive.Second, the operations of the relational algebra are not well suited tonatural spatial queries, such as nearness queries and region queries.

A second application which is not well suited for the relational modelis object-oriented programming systems. Object-oriented languages, suchas Smalltalk, C++ and Java, facilitate the definition ofprogrammer-defined entity types called classes. Individual entities ofthese entity types are called objects. Complex entities and entity typesare composed primarily using two relationships. First, the HAS_Arelationship is used to compose simpler objects into more complexobjects. That is, objects have parts which are other objects. An IS_Arelationship is used to combine entity types into more complex types.

The IS_A relationship, or inheritance as it is called in theobject-oriented paradigm, is a powerful new technique introduced by theobject-oriented paradigm. The IS_A relationship is a relationshipbetween entity types, rather than just individual entities. If an entitytype MANAGER is specified to inherit type EMPLOYEE, then the MANAGERtype is a special type of EMPLOYEE (i.e., a IS_A relationship). EveryMANAGER entity has all the attributes every EMPLOYEE entity has, plusany attributes that are specified in type MANAGER. This programmingmechanism greatly facilitates the construction of complex softwareapplications by making it much less labor intensive and less error proneto model the natural inheritance relationships found in applications.

In execution, an object-oriented application is a complex network ofobjects related by the HAS_A and IS_A relationships. The natural notionof data storage for such a system is the notion of object persistence.That is, it should be easy to store an object and all the objects itrefers to in a database, thus making the object persist after theprogram that created it has finished execution. Similarly, it should beeasy to retrieve the object when execution resumes.

Attempts to use the relational model to store object-oriented datasuffer one of the same difficulties as described above for spatial data,which is complex, recursive HAS_A relationships are difficult toimplement in the relational model. A more severe problem is the IS_Arelationship can not at all be implemented directly in the relationalmodel. In the context of a relational data base, the IS_A relationshipis a relationship between relation types. As discussed above, a relationtype is not a relation, but is a set of attributes. Thus, the relationtypes as such can not be represented or operated on within the model.

A third application area for which the relational model is not wellsuited, and an increasingly commercially important one, is numericalsimulation or scientific computing. Simulation software is aimed atpredicting the outcome of complex physical, biological, financial, orother processes by building mathematical models and numerically solvingthe resulting equations. Defense, petroleum exploration, and medicalimaging have been the classical applications for scientific computing.However, as the price of numerical computation has dropped, it isincreasingly cost effective to use simulation in a wide range ofapplications. For example, the manufacturing industry is replacing theconventional design-build-test-redesign product development cycle with adesign-simulate-redesign cycle. Similarly, financial trading is directedby market simulations and major metropolitan TV stations produce theirown weather simulations, complete with computer generated animations.

Simulations combine features of spatial data and object-oriented data.The results of the simulation usually represent the dependence of someproperty on space or time. For example, the result may represent thedependence of mechanical stress on position within the product, or astock price on time, or a temperature on location. Thus, simulation datausually contains embedded spatial data representing the shape of theproduct, the interesting intervals of time, or the geography of theregion of interest. In addition, the space and time dependent propertiescomputed are usually complex mathematical types with important IS_Arelationships between them.

In addition to sharing these features with spatial data andobject-oriented data, simulation data has another essential featurewhich is the data sets tend to be very large. The amount of data thatmust be processed in a simulation is directly proportional to thedesired accuracy. The quest for accuracy always requires that thesimulations be run at or over the limits of the computational resource.

SUMMARY OF THE INVENTION

Accordingly, one object of the present invention is to solve theabove-noted and other problems.

Another object of the present invention is to provide a novel data modelwhich efficiently deals with spatial data, object-oriented programmingapplications and simulation applications.

Another object of the present invention is to provide novel algebraicoperators which operate on the data model according to the presentinvention.

To achieve these and other objects, the present invention provides anovel method of representing data on a computer, including the steps ofconstructing a first table to represent an entity type with a column inthe table for a respective attribute of the entity type, and enteringattribute data into rows of the first table. The method also includesthe steps of constructing a row graph which represents an orderingrelationship between the rows of the first table, and assigning a columngraph which represents an ordering relationship between columns of thefirst table. The column graph is a row graph from a second table.

The present invention also provides a novel data model including a firsttable to represent an entity type having a column in the table for arespective attribute of the entity type, and having rows entered withattribute data, and a row graph which represents an orderingrelationship between the rows of the first table. Further, the datamodel includes a column graph which represents an ordering relationshipbetween columns of the first table; in which the column graph is a rowgraph from a second table.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete appreciation of the present invention and many of theattendant advantages thereof will be readily obtained as the samebecomes better understood by reference to the following detaileddescription when considered in connection with the accompanyingdrawings, wherein:

FIG. 1 a illustrates an example of a domain of the relational datamodel;

FIG. 1 b illustrates a binary Cartesian product of two sets A and B inthe relational data model;

FIG. 1 c illustrates a table which is a subset of the Cartesian productshown in FIG. 1 b;

FIG. 2 a illustrates an example of a relational model directed to apersonal application including employees;

FIG. 2 b illustrates an example of a relational model corresponding to arelationship between workers and managers;

FIG. 2 c illustrates a resulting table formed by executing a selectionoperator in the relational data model;

FIG. 2 d illustrates another resulting table produced by executing theselection operation in the relational data model;

FIG. 2 e illustrates a resulting table produced by executing aprojection operator in the relational data model;

FIG. 2 f illustrates a resulting table produced by executing a unionoperator in the relational data model;

FIG. 2 g illustrates a resulting table produced by executing anintersection operator in the relational data model;

FIG. 3 illustrates a simple spatial object;

FIG. 4 a illustrates a partially ordered set including a table andcorresponding graph of the simple spatial object shown in FIG. 3according to the present invention;

FIG. 4 b illustrates a resultant poset after executing a Down operator;

FIG. 4 c illustrates a finite distributive lattice corresponding to thepartially ordered set shown in FIG. 4 a;

FIG. 5 illustrates a simple spatial object lattice corresponding to thesimple spatial object shown in FIG. 3;

FIG. 6 illustrates a schema lattice corresponding to the simple spatialobject lattice shown in FIG. 5;

FIG. 7 illustrates an example of a discretization lattice for thetriangle shown in FIG. 3;

FIG. 8 illustrates a discretization map for the discretization latticeshown in FIG. 7;

FIG. 9 illustrates a fiber space schema for the field example;

FIG. 10 illustrates that a schema for the field is the tensor product ofthe fiber schema and the discretization; and

FIG. 11 illustrates a finite sheaf for a real field on triangle.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The above-noted problems associated with the relational model (i.e.,using the relational model to represent spatial, object-oriented andscientific data) all originate because the relational model provides noexplicit mechanism for representing inclusion. Two distinct types ofinclusion are:

1) row inclusion: HAS_A relationships correspond to row inclusion (e.g.,the decomposition relationships of spatial data and the objectcontainment relationships of object-oriented data). For example, an edgeentity, represented by a row, is conceptually included in a polygonentity represented by another row; and

2) column inclusion: IS_A relationships correspond to column inclusion(e.g., the inheritance relationship of object-oriented data). If typeMANAGER inherits type EMPLOYEE, then a MANAGER table includes all thecolumn headings of an EMPLOYEE table.

The theory of partially ordered sets may be used to address inclusion. Apartially ordered set, or poset as it is frequently abbreviated,includes two components: 1) a set of objects, called the base set; and2) a reflexive, antisymmetric, transitive relation on the base set,called the ordering relation. The ordering relation explicitly defineswhich members of the base set are included in each other.

The table analogy discussed above with reference to the relational modecan also be used to describe a partially ordered set. In this instance,a poset includes a table and a directed, acyclic graph. The tablerepresents the base set and the graph represents the ordering relation.

For example, FIG. 3 illustrates a very simple spatial object comprisinga single triangle 6 including three vertices 0, 1, 2; three edges 3, 4,5 and the interior space of the triangle 6.

FIG. 4 a shows a table analogy 42 of a poset corresponding to spatialobject shown in FIG. 3. The table analogy 42 includes a base set 44having one row for each of the entities in the triangle (e.g., the threevertices 0, 1, 2; the three edges 3, 4, 5; and the interior space). Thetable analogy 42 also includes a graph 46, which represents the orderingrelation (i.e., the inclusion relationships). Each “node” in the graphis labeled with the ID of the entity it represents and there is a “link”from each node to the node representing the next most inclusive entity(note that the links are directional.) An entity is included in anotherentity if there is a path in the graph 46 from the node corresponding tothe first entity to the node corresponding to the second entity. Forexample, referring to the graph 46, the vertex v0 (ID=0) is included inthe triangle t0 (ID=6) because there is a link from node 0 to node 3 anda link from node 3 to node 6.

If an entity A is “next most inclusive” to entity B, there is no entitybetween A and B (i.e., there is no entity C between A and B). Thus, forany given entity, there may be more than one next most inclusive entity.For example, both edges e0 (ID=3) and edge e2 (ID=5) are “next mostinclusive” to vertex v0. Thus, the meaning of the term “partial order”is that the members of the base set are ordered with respect to eachother, but not totally ordered so that every member has exactly one“next larger” member. In a partial order, a member can have one nextlarger member, many next larger members, or no next larger members. Thedefinition of a partially ordered set also includes the case in whichevery member of the base set has no next larger members. Thiscorresponds to the ordinary, unordered set.

In addition, the ordering relation of a partially ordered set is oftenreferred to by the phrase “less than or equal to.” For example, in FIG.4 a, one can say v0≦e0, which means v0 is included in e0. The “next mostinclusive” relation is often referred to as the “covers” relation andthe graph is often called a “Hasse diagram.”

All the operators of the relational algebra may be configured to work onposets. The effect of any of the operators on the table part of a posetis the same as in the relational case, but each operator must beconfigured to also operate on the graph part (discussed in more detaillater).

In addition to the relational algebra operators, there are a number ofother poset operators that are derived from the order relation. Twoposet operators will now be described in which it is assumed a₁, a₂,etc., are rows in a poset table A:

1) a₁≦a₂, if and only if there is a path in the graph from the noderepresenting a₁ to the node representing a₂. This is a poset querycommand in which a value corresponding to TRUE or FALSE will bereturned. That is, if a₁ is less than or equal to a₂ as defined, a TRUEvalue will be returned. 2) Down(a) is another poset operator whichreturns a poset that contains all the members of A that are less than orequal to “a”. The result is called the down set of “a”. For example,FIG. 4 b illustrates a resultant poset 80 after the command “Down(4)” isexecuted (member with id=4) for the simple spatial object shown in FIGS.3 and 4 a. As shown, this command returns the IDs 4,1 and 2 whichcorrespond to the edge e1 and vertices V1 and V2. Thus, by executing theDown(a) operator, it is possible to determine all the members of theposet A which are less than or equal to “a.”

The name “down set” originates in the standard mathematical practice ofdrawing links so they point up. Thus if a1≦a2, then a1 is below a2 inthe graph; smaller members are always below larger members. In such avertical graph, the down operator literally goes down the graph, hencethe name. To be visually consistent with the rows in the table, thelinks in the graphs shown in the figures according to the presentinvention point from right to left (and not in a downward manner).

The operators thus defined operate on entities specifically appearing inthe table. In applications in which inclusion plays an important role,it is often important to treat a collection of entities as if it was anentity itself, a sort of “virtual” row in the table. For instance, inspatial applications, it is often important to deal with the boundary ofan object. The boundary of the simple spatial object (i.e., triangle 6)shown in FIG. 3 is a collection of three edges, but it is oftendesirable to treat it as a single entity, the boundary.

Lattice theory may be used to accomplish this. In more detail,associated with every finite poset is another poset, a special type ofposet called a finite distributive lattice (henceforth “FDL” or just“lattice”). FIG. 4 c shows the FDL 90 for the simple spatial objectshown in FIGS. 3 and 4 a. The number of members of an FDL is typicallymuch greater than the number of members of the poset that generates it.For simplicity and readability, the graph is drawn in the traditionalmathematical orientation (i.e., in a downward fashion). Icons also showthe geometrical meaning of each member of the lattice, instead of IDattributes as used in previous figures.

For example, icon 92 illustrates the complete triangle 6 including allmembers of the poset. Icon 94 includes member IDs 4 and 5 whichcorrespond to edges e1 and e2, respectively. Icon 96 includes member IDs2 and 3 which correspond to edge e0 and vertex V2. Any icon below andconnected to icon 96 is included in icon 96.

Intuitively, the lattice contains all the members of the original posetplus all distinct combinations of them. Two different combinations ofmembers are distinct if they do not represent the same inclusion. Forinstance, the combination of just edges e0 and e1 is distinct from thecombination of edges e0, e1, and e2, since the former combination doesnot include all the points in edge e2. Conversely, the combination ofthe three edges is not distinct from the combination of the three edgesand the three vertices. These two combinations (edges andedges+vertices) are equivalent because the vertices are already includedin the edges; adding them to the combination doesn't include anyadditional points. Consequently, the lattice in FIG. 4 c contains asingle member for the boundary (i.e., icon 95), it does not containseparate members for the collection of three edges and for thecollection containing three edges and three vertices. The lattice is notthe set of all subsets of rows of the table. Thus, the lattice generatedby a poset is a poset itself and can be thought of using the tableanalogy similar to that shown in FIG. 4 a, for example. The lattices'table contains all distinct combinations of rows of the original posetand its graph contains all the inclusion relations.

In addition, in a lattice there are two additional operations defined.In the following operators, l₁, l₂, . . . 1_(n) are members of a latticeL. A first operator according to the present invention is the Joinoperator. In more detail, the operator Join(l₁, l₂, . . . , l_(n))returns the smallest member of L which is greater than or equal to allof its inputs. For example, referring to FIG. 4 c, the Join of ID's 3,4, and 5 respectively shown in icons 98, 100 and 102, results in theboundary of the triangle shown in icon 95. A second operator Meet(l₁,l₂, . . . , l_(n)) returns the largest member of L which is less than orequal to all of its inputs. For example, the Meet of ID's 3, 4respectively shown in icons 98 and 100 results in the vertex v1 shown inicon 104.

Now to incorporate column inclusion into the model. To do this, thetable analogy is expanded so that there are two graphs associated withthe table. That is, a first graph as shown in FIG. 4 a (hereinafterreferred to as the row graph), and a new graph (hereinafter referred toas the column graph). The column graph describes the inclusion structureof the columns.

In the sheaf data model, every lattice has an associated lattice, whichis referred to as a schema. The column graph of a lattice is defined bythe row graph of its schema. The schema relationship is recursive: aschema lattice has to have a schema lattice. This recursion isterminated in a special lattice, the primitive schema lattice, which isits own schema.

The lattice of the triangle 6 shown in FIG. 3 and its correspondingschema lattice are shown in FIGS. 5 and 6, respectively. FIG. 5illustrates the lattice 70 including a row graph 46, column graph 72 andtable 73. The table 73 includes columns 74, 76 and 78 respectivelycorresponding to an ID, NAME AND GEOMETRY of the entity type. FIG. 6illustrates the corresponding schema lattice 110. The schema lattice 110includes a row graph 112, column graph 114, and table 115. The table 115includes rows 116, 118 and 120 respectively corresponding to the columns74, 76 and 78 of the lattice 70 shown in FIG. 5.

Thus, using the schema lattice 110, it is possible to determine thevariable type of the primary entities in the rows of the table 73. Forexample, referring to table 73 (FIG. 5), ID number 3 corresponds to edgee0 of the triangle 6 shown in FIG. 3. Referring to the schema lattice110 (FIG. 6), it is possible to determine the ID number 3 is an integertype with a size of 4 bytes. Similarly, the name “e0” is a string typewith a size of 4 bytes and the geometry “edge” is also a string typewith a size of 4 bytes.

The association between a lattice and its schema introduces three moreoperators. An exponentiation operator EXP(L) returns a lattice withschema L. The table and row graph of the result are empty. A logarithmoperator LOG(L) returns the schema lattice associated with lattice L. Arestriction operator RESTRICT L TO s, where s is a member of the schemaof L, returns the projection of L onto the columns in the down set of s.

Turning now to sheaves. The table of a lattice L is the Cartesianproduct of the rows of the schema lattice, where each row is interpretedas a domain. By using RESTRICT L TO s successively for each member s ofthe schema lattice we can define a family of tables, one for each memberof the schema. Each member of this family is itself a Cartesian productover a subset of the rows of the schema lattice.

An association, or map, generated in this manner between a lattice and afamily of Cartesian product sets is called a sheaf. The schema latticeis referred to as the source of the sheaf and the family of product setsis referred to as the target of the sheaf. The largest member of thetarget, the table which is restricted to produce all the other membersof the target, is called the top table.

The row graph of the top table is not defined by the schema. It can bearbitrarily chosen by the user. Once the row graph is defined, the toptable defines an FDL and can itself be used as the schema for anotherlattice.

Hence, every lattice defines a sheaf of Cartesian product sets (tables)and this sheaf can be viewed as the primary object of the data model.The table, row graph, and column graph, as well as the relational,poset, lattice, and sheaf operators can all be considered differentaspects of the sheaf object. This is the origin of the name sheaf datamodel.

The sheaf structure and operators introduce column inclusion into thedata model, but they also add an additional, critical feature which is adata dependent schema. The schema of a table is defined by the contentsof another table, not predefined to some fixed set of columns. Thisfeature is essential for representing simulation data.

As discussed above, all the operators of the relational algebra can begeneralized to work on either an FDL or a sheaf. The typical effect ofany of the operators on the table part of an FDL or sheaf is the same asin the relational case, but for an FDL each operator must be configuredto also operate on the row graph, while for a sheaf each operator mustbe configured to also operate on both the row graph and the columngraph. The appropriate configuration for each of the six basicrelational operators is discussed below.

1) The Cartesian product operator. For the FDL configuration, the tableof the result of the Cartesian product A×B, where A and B are both FDLs,is the same as for the relational configuration.

The row graph is arbitrary and may be chosen to be any order relationthe user desires. However, there are two common and important choices.Let (a₁, b₁) and (a₂, b₂) be two rows in the product table:

product order: (a₁, b₁)≦(a₂, b₂) precisely when a₁≦a₂ and b₁≦b₂

lexicographic order: (a₁, b₁)≦(a₂, b₂) precisely when a₁=a₂ and b₁≦b₂

The choice of order must be provided as a parameter to the operator.

For the sheaf configuration, the table and the row graph of the resultof A×B, where A and B are sheaves, is the same as the FDL configuration.The column graph (schema) of the result is the disjoint union of thecolumn graphs of A and B.

2) The selection operator. For the FDL configuration, the table of theresult is the same as for the relational operator. The row graph is agraph which satisfies the row selection condition, specified as follows:let g0 be the reflexive, transitive closure of the row graph of theinput and let the g1 be the subgraph of g0 containing the nodescorresponding to the set of rows which satisfy the selection conditionand all the links which reference only nodes corresponding to theselected set. The graph which satisfies the row selection condition isthe reflexive, transitive reduction of g1.

For the sheaf configuration, the table and the row graph of the resultis the same as the FDL configuration. The column graph of the result isthe same as the column graph of the input.

3) The projection operator. For the FDL configuration, the table of theresult is the same as for the relational operator, except duplicate rowsare not discarded. The row graph of the result is the same as the rowgraph of the input.

For the sheaf configuration, the table and the row graph of the resultis the same as the FDL configuration. The column graph of the result isa graph which satisfies the column selection condition, specified asfollows: a graph satisfies the column selection condition if and only ifit is the graph formed as the result of the selection operator with arow selection condition corresponding to the column selection condition,operating on the row graph of the schema sheaf of the input.

4) The union operator. For the FDL configuration, the table of theresult is the same as for the relational operator. The row graph is thereflexive, transitive reduction of the union of the row graphs of theinput posets, where the union of two graphs is the graph formed by theunion of the node sets of the two graphs and the union of the link setsof the two graphs.

For the sheaf configuration, the table and the row graph of the resultis the same as the FDL configuration. The column graph of the result isthe same as either of the column graphs of the two inputs, which mustboth have the same column graph.

5) The intersection operator. For the FDL configuration, the table ofthe result is the same as for the relational operator. The row graph isthe reflexive, transitive reduction of the intersection of the rowgraphs of the inputs, where the intersection of two graphs is the graphformed by the intersection of the node sets of the two graphs and theintersection of the link sets of the two graphs.

For the sheaf configuration, the table and the row graph of the resultis the same as the FDL configuration. The column graph of the result isthe same as the column graph of either of the inputs, which must bothhave the same column graph.

6) The rename operator. For both the FDL configuration and the sheafconfiguration, the rename operator is the same as in the relationalmodel.

In summary, the sheaf data model provides a formal, mathematical datamodel and explicitly incorporates inclusion. The algebra associated withthe model contains relational, poset, lattice, and sheaf operators whichprovide the basis for a complete data definition and manipulationlanguage.

The sheaf structure and its operators form an extremely usefulabstraction. However, the sheaf structure suffers from a severepractical problem. In more detail, the source of a sheaf is the finitedistributive lattice (FDL) containing “all possible distinctcombinations” of members of a client-defined poset. The problem is evenfor very small posets, the number of “all possible distinctcombinations” of rows is astronomical. It is completely infeasible togenerate and store the entire source lattice. For the same reason, it isinfeasible to store the target of the sheaf (i.e., the family of productsets).

The present invention solves this problem by combining data structuresand algorithms to utilize the sheaf concepts without actually generatingthe entire source and target. This combination is referred to as thefinite sheaf data type. In order to understand this data type, a fewfacts about FDLs will now be introduced.

As discussed above, an FDL contains the members of the original posetand all distinct combinations thereof. The members of the original posetare referred to as the join-irreducible members or “jims” of thelattice, while the “distinct combinations” are “join reducible members”or “jrms” (pronounced “germs”).

Based on a Birkhoff representation theorem, a jrm is equal to the joinof the collection of jims contained in its down set (this collection ofjims is the “distinct combination” associated with the jrm.)

From the usual mathematical point of view, an FDL is a given,pre-existing base set and ordering relation (i.e., a fully instantiatedtable and graph). Every member of the lattice is represented by a rowand a node in the graph; every inclusion relationship is represented bya path in the graph. From this point of view, the Birkhoffrepresentation theorem is a statement about a relationship that mustexist between the nodes and links of the graph. The Join and Meetoperators are queries that find the proper member using the (fullyinstantiated) graph.

The fundamental mechanism making it practical to use the sheaf formalismis a form of deferred computation or “lazy evaluation.” Instead ofmimicking the mathematics and instantiating the entire lattice, thepresent invention instantiates the jims and only the jrms the userspecifically requests. This approach reduces the storage requirements tofeasible levels, but forces extension and reinterpretation of themathematics.

Turning now to a finite sheaf data type, the finite sheaf data type(henceforth “finite sheaf” or just “sheaf”) includes a data structureand a collection of operators on the data structure that implement thelazy evaluation strategy described above.

The data structure includes the following components andinterpretations:

-   -   1) schema: a reference to another instance of a finite sheaf        data type;    -   2) table: a collection of records. Table and record types are        widely used in computer science and can be represented in a        variety of ways, any of these well known methods are suitable.        There must be a one-to-one correspondence between rows in the        schema and columns in the table; and    -   3) row graph: a directed acyclic graph. The directed acyclic        graph (“DAG” ) is also a well known data structure with a        variety of representations, any of which are acceptable. There        must be a node in the graph for each row in the table, but the        graph in general will contain additional nodes, not associated        with a specific row in the table.

The interpretation of this data structure is that the table representsthe top table of the sheaf defined by the schema. Each row in the tablerepresents a jim in the row lattice of the top table. The row graphrepresents the order relation for the row lattice. Nodes in the graphwhich correspond to rows in the table represent jims in the lattice,while the remaining nodes represent jrms. The links in the graphrepresent the “next most inclusive” relation (also known as the coverrelation in mathematical lattice theory). The collection of jimsassociated with each jrm by the Birkhoff theorem is generated bytraversing the graph below the jrm.

In the usual mathematical formulation of an FDL, each member is unique.But in practical computing applications, a user may want to havemultiple copies of a lattice member. The data structure supports this byhaving the graph represent a lexicographic ordering relation. Alexicographic ordering relation is a generalization of the order wordsappear in a dictionary. Words are first ordered by their first letter.All words with the same first letter are then ordered by their secondletter, etc. The first “letter” in the finite sheaf order is derivedfrom the Birkhoff theorem. Member 1 ₁ is less than the member 1 ₂ if theset of jims in the down set of 1 ₁ is a subset of the set of jims in thedown set of 1 ₂. The second “letter” is the order the members werecreated in. Lattice members which are copies have the same set of jimsin their down set, the same first “letter”, and are ordered relative toeach other by the second “letter”, in the order they were created in.

The table and graph combination stores all the jims of the row lattice,but only those jrms that the user specifically creates.

The finite sheaf data type supports all the relational, poset, lattice,and sheaf operators of the sheaf data model, as described above. Inaddition, the finite sheaf data type extends and reinterprets themathematics as follows:

First, the set of operators must be extended to include operations forcreating the jims and the order relation:

CREATE_JIM: creates a jim as a row in the table and corresponding nodein the graph.

DELETE_JIM (JIM_ID): deletes the row and node corresponding to the jimwith identifier jim_id.

CREATE_LINK (LESSER_ID, GREATER_ID): creates a link in the graph betweenthe jims identified by lesser_id and greater_id.

DELETE_LINK (LESSER_ID, GREATER_ID): deletes the link between the jimsidentified by lesser_id and greater_id.

Second, the join and meet operators must be reinterpreted.Mathematically the result of these operations is guaranteed to exist,and hence these are query operations. They find the proper member usingthe order relation (i.e., row graph.) But if only previously requestedjrms have been instantiated, then the result of a meet or join may notexist. The result has to be created and linked into the graph. In otherwords, instead of deriving the result from the order relation, the orderrelation must be derived from the result. Efficient algorithms forcomputing the join and meet are described in appendix A, which isincorporated in its entirety.

Problems of practical interest require the table and graphs associatedwith the finite sheaf type to be stored on disk, outside of the mainmemory of the computer. Efficient access to such externally stored datamust take into account the properties and performance characteristics ofdisk storage. This problem has been extensively studied in the contextof relational data base management technology.

The standard solution relies on constructing hierarchical indexstructures which allow retrieval of any record with a minimum number ofdisk accesses. The best known index structures are the B-tree and itsvariants. Nodes in the B-tree correspond to hierarchical groupings ofrecords in the table.

The key to efficient indexing of the finite sheaf is the followingobservation: the hierarchical groupings of the B-tree are jrms in therow lattice. They are jrms chosen specifically to optimize disk access.Hence, the row graph itself can be used as an index. In addition to thejrms explicitly constructed by the user, internal routines of the finitesheaf type can construct jrms intended purely for use in achievingefficient disk access.

Turning now to applications which may use the sheaf data model. Themathematical study of spatial structure is organized into two broaddisciplines. Topology is the study of continuity, nearness, andconnectivity without regard to explicit shape and size. Geometry addsshape, size and measure to topology. The theory of topology can beformulated entirely in terms of lattice theory. Furthermore, recentresearch in computational geometry has established that all existingmethods of geometry representation can be described using finitedistributive lattices. The sheaf data model provides a directrealization of this mathematical structure and hence is ideal forstoring and manipulating spatial data.

There is however, an additional operator, not described above, that isparticularly convenient for creating instances of the finite sheaf typerepresenting spatial data. Spatial data often appears in the form of amesh, a large number of interconnected geometric primitives, all thesame type, or of related types. As a simple example, the shape of aproduct may be specified in a CAD/CAM system by a triangle mesh—a largenumber of triangles connected together at their edges so as to cover thesurface of the product. Such meshes are even more common when spatialdata is used in the context of a simulation.

Mesh data is usually presented by specifying the number and type of thegeometric primitive and by specifying the so-called “connectivity” data.The connectivity data describes how the primitives are to be connected,typically by listing the vertices that appear in each primitive. So atriangle mesh could be specified by stating the number of triangles,then specifying 3 vertex identifiers for each triangle. Two trianglesare implicitly connected at a point if they both contain the samevertex, and connected at an edge if they share two vertices.

The additional operator is the cellular lattice constructor that makesit convenient and efficient to build the table and graph of the latticecorresponding to a mesh, given the usual input data. An algorithm for anefficient cellular lattice constructor is given in Appendix B, which isincorporated in its entirety.

Recent research in computer science has demonstrated the inheritancerelationships between classes in an object-oriented application generatea mathematical lattice. The sheaf data model is thus able to directlyand precisely represent inheritance relationships.

Object containment relationships can be divided into two categories:cyclic and acyclic relationships. In a cyclic relationship A contains Bcontains C contains . . . contains A. In other words, the chain ofrelationships eventually forms a circle. In an acyclic relationship, thechain is linear. The sheaf data model, as stated, represents onlyacyclic containment relationships.

As discussed above, simulation results typically represent thedependence of some property on space and time. In mathematical physics,such space and time dependent properties are called fields. The abstractfields of mathematical physics can be represented by sheaves. Animportant part of the present invention described here is the method bywhich the concrete field data of numerical simulation can be interpretedas a sheaf.

A field is a map that associates a value of some property, called thefiber space, with every point in some object, called the base space.Both the fiber space and the base space can be represented as finitesheaves. The representation of an abstract field as a finite sheafrequires the following information be provided:

-   -   1) Base space sheaf (FIGS. 3 and 4 c);    -   2) Fiber space schema sheaf (FIG. 9);    -   3) Discretization map (FIG. 8): a map that associates each        member of the base space lattice with a member of an arbitrary        finite sheaf called the discretization (FIG. 7) of the base        space. The image of a member of the base space lattice under the        discretization map is also called the discretization of the        member. Typically the discretization is generated from the base        space lattice itself. For instance the jims of the        discretization are chosen to be the set of all the vertices in a        mesh and the discretization jrm associated with a base space jrm        is the subset of vertices contained in the down set of the base        space jrm (FIG. 8);    -   4) Evaluation subposet (FIG. 8, triangle 6): a subset of the        base space lattice. This subset must be chosen so that it covers        the base space, for instance the set of all triangles in a        triangle mesh. Every member of the evaluation subposet is        assumed to carry a local coordinate system; and    -   5) Evaluation method: a rule that can be used to compute the        value of the field given the local coordinates of a point in a        member of the evaluation subposet and the degrees of freedom        (defined below) associated with that member. For example, the        evaluation method associated with FIG. 8, triangle 6 is called        linear interpolation.

The schema (FIG. 10) for the sheaf of fields (FIG. 11) with a given basespace and fiber space is the tensor product lattice of thediscretization and the fiber space schema. The jims of the tensorproduct lattice are all pairs of the form (d, f) where d is a jim of thediscretization and f is a jim of the fiber space schema. As with anyfinite sheaf, there is a column in the table of the sheaf for each jimin its schema. The domain of the column associated with schema jim (d,f) is defined to be the domain of f; the domain of d is ignored. A fieldis represented by a row in the table and the data in the cells of therow is referred to as the degrees of freedom of the field. The degreesof freedom associated with any pair (b, f), where b is a member of thebase space lattice and f is a member of the fiber schema, is therestriction of the row to the schema member (d(b), f), where d(b) is thediscretization of b.

Any numerical representation of a field can be interpreted as a sheafusing the above method. The ability of the sheaf data model to directlyrepresent arbitrary fields, in addition to traditional relational data,spatial data, and object-oriented data, makes it an ideal model forscientific data.

This invention may be conveniently implemented using a conventionalgeneral purpose digital computer or microprocessor programmed accordingto the teachings of the present specification, as will be apparent tothose skilled in the computer art. Appropriate software coding canreadily be prepared by skilled programmers based on the teachings of thepresent disclosure, as will be apparent to those skilled in the softwareart. The invention may also be implemented by the preparation ofapplication specific integrated circuits or by interconnecting anappropriate network of conventional component circuits, as will bereadily apparent to those skilled in the art.

The present invention includes a computer program product which is astorage medium including instructions which can be used to program acomputer to perform a process of the invention. The storage medium caninclude, but is not limited to, an type of disk including floppy disks,optical disks, CD-ROMs, and magneto-optical disks, ROMs, RAMs, EPROMs,EEPROMs, magnetic or optical cards, or any type of pure softwareinventions (e.g., word processing, accounting, Internet related, etc.)media suitable for storing electronic instructions.

Obviously, numerous modifications and variations of the presentinvention are possible in light of the above teachings. It is thereforeto be understood that within the scope of the appended claims, theinvention may be practiced otherwise than as specifically describedherein.

Appendices

Appendix A Join and Meet Algorithms

A.1 Bottom-Up Join Algorithm

By definition, the result of the join operation is a jrm. A jrm isdefined by the intersection of its down set with the set of jims J. Inour case, a jrm g is presented as the join of the members of a clientspecified subposet S. The jrm g is then defined by intersection of thedown set of S with the set of jims J.

Since the construction “intersection of the down set of x with J” occursfrequently in the following, it is useful to define a notation for thisset:J(x)=down(x)∩Jwhere x is either a member p of the lattice or a subset S of the lattice

In order to place g in the existing cover relation graph, we need tofind the maximal lower bound and minimal upper bound for g in theexisting graph. The maximal lower bound is the set of maximal membersthat are less than or equal to g while the minimal upper bound is theset of minimal members that are greater than or equal to g. If g isalready in the graph, the maximal lower bound will contain a singlemember, the greatest lower bound, which must be equal to g.

Similarly, the minimal upper bound will contain a single member, theleast upper bound, which also must be equal to g. If g is not in thegraph, the maximal lower bound is the lower cover for g and the minimalupper bound is the upper cover for g.

Let S be a subset of the members of a lattice L. The bottom-up algorithmfor computing g=join(S) is:

-   -   1. compute J(S)    -   2. compute the maximal lower bound of g from J(S)    -   3. compute the minimal upper bound of g from the minimal lower        bound.    -   4. if g is not already in the graph, insert it between the        minimal upper bound and the maximal lower bound

J(S) is computed by a straight forward traversal of the down set of S. Abottom-up algorithm for computing the maximal lower bound and analgorithm for computing the minimal upper bound follow.

A.1.1 Compute the maximal lower bound:

The maximal lower bound is the set of maximal members of the down set ofg. Thus to place g in the cover relation, we must compute the maximalmembers of the down set of g. This is the inverse of the usualdefinition of the down set, where we are given g and the cover relationand can find down-g by transitivity of the cover relation. Here, we aregiven only down-g∩J and must find all other members g′ such thatdown-g′∩J is included in down-g∩J.

For notational convenience define J(g)=down-g∩J. Then in this notation,g′<=g iff J(g′) is included in J(g).

The algorithm below depends on two lemmas:

Lemma 1:

-   J(g′) is included in J(g) iff:    -   For g′ a jrm, for all g″ in the lower cover of g′, J(g″) is        included in J(g).    -   For g′ a jim, g′ is a member of J(g)

Proof:

Part (a):down-g′={g′}∩down-g1″∩ . . . ∩down-gn″J(g′)=J({g′})∩J(g 1″)∩ . . . ∩J(gn″)=J(g 1″)∩ . . . ∩J(gn″) sinceJ({g′})=0 if g′a jrm. <J(g)Iff each J(gi″)<J(g)

Part (b):

-   -   This is just a restatement of the definition of g, i.e. the        Birkhoff representation theorem.

Lemma 2:

For every member g′ of down-g, there is a chain j<: p1<: p2<: . . . <:pn<: g′, for all minimal members j of down-g, where “<:” is the coverrelation.

Proof:

By definition j<=g′ since g′ is a member of down-g and j is a minimalmember. The chain condition is just a statement of the fact that theorder relation <= is the reflexive transitive closure of <:.

The client defines the jrm g by specifying a “join expansion”, i.e. somesubposet s. Then J(g) is defined to be the set of jims contained in adepth first traversal of the stored cover relation, starting at s. Thatis, J(g) is derived from the existing cover relation.

We maintain two subposets, gdown for the down set of g and gdown_max forthe maximal members of the down set. Both are initialized to containJ(g). We then repeatedly “reduce” gdown_max, as follows:

Let gdown_max_up be the upper cover of gdown_max, i.e. the union of theupper covers of the members of gdown_max. Let g′ be a member ofgdown_max_up. If g′ is a jrm and the lower cover of g′ is included ingdown, then J(g′) is included in J(g) (Lemma 1) and hence g′<g so weinsert g′ into gdown. If g′ is a jim, g′<g iff it is already in gdown.In either case, g′ is larger than any member of its lower cover and itshould replace any members of its lower cover in gdown_max. So we removeany members of g′.lower_cover and insert g′ in gdown_max. We continueuntil we can not reduce gdown_max any further, either because it hasonly a single member or because gdown_max_up contains no members withlower covers contained entirely in gdown.

At each step of the above process we have that gdown contains onlymembers of the down set of g and at each step, the set of maximalmembers is reduced by replacing some members in it with larger members.The process does not complete until all the members of gdown_max aremaximal. Further more, all members of down-g are reachable by thisprocess (Lemma 2). So when the reduction completes, it contains the allmaximal members of down-g that are present in the graph. If gdown_maxcontains a single member, it is g itself, otherwise gdown_max is thelower cover of g.

A. 1.2 Compute the Minimal Upper Bound:

The algorithm for the minimal upper bound (mub) depends on the followinglemma:

Lemma 3:

Define the minimal upper bound for any subposet S as:mub(S):=min(intersection(up-s, for all s member of S))

Then join(S)<=mub(S)

Proof:

For each s, up-s is the set of all p such that s<=p. Thenintersection(up-s) is the set of all p such that every s in S is <=p.But then join(S)<=p for all p (see Davey and Priestley Lemma 2.9.iii)and hence join(S)<=min(intersection(up-s)).

If join(S)<mub(S), then mub(S) is the upper cover of join(S), otherwise,obviously, join(S)=mub(S). Unfortunately, there is no simple conditionthat distinguishs the two cases. In particular, size of mub(S)=1 is anecessary condition for equality, but it is not a sufficient condition.The necessary and sufficient condition is that the lower cover ofjoin(S)=lower cover of mub(S).

We can compute mub(s) as follows:

Let s1, s2, . . . sn denote the members of S. Define two cover sets C0and C1. Initialize C0 to up-s0. Then:

for i= 2,n { c1 = up-si c0 = c0 intersection c1 }

 c0=min(c0)

-   -   now c0 contains either the join or it's upper cover        A.2 Top-Down Join Algorithm

As above, let S be a subset of a lattice L, let g=join(S), and letM=mub(g).

The maximal lower bound (m1b) of g is contained in the lower cover of M.In fact, we havemlb(g)={p|pεM.lower_cover and J(p)⊂J(g)}

Now the condition J(p)⊂J(g) will be satisfied if and only if thecondition J(p′)⊂J(g) for all p' εp.lower_cover. In other words, thecondition is recursive.

We can compute J(S) and mub(g) as above. Then we can compute m1b(g) topdown as follows:

Initialize Q=M.lower_cover

For each member q of Q:

-   -   perform a depth first traversal of down(q). In a depth first        traversal, there are three possible actions associated with each        node in the graph: the previsit action, the ink action, and the        postvisit action. Let p be the current node in the graph. Assume        that each node p has a boolean variable is contained that is        true if J(p)⊂J(g).

In the previsit action:

if p is ajim, set p.is_contained = J(g).contains_member(p) else setp.is_contained = true

In the link action:

set p.is_contained = p.is_contained AND p′.is_contained

-   -   where p′ is the node at the lesser end of the link.

When the traversal completes, if not q.is_contained, remove q from Q.

end for

Q now contains only those members m of M.lower_cover such J(m)⊂J(g) andhence: mlb(g)=Q.

As above, if g is not already in the graph, insert it between theminimal upper bound and the maximal lower bound.

A.3 Meet Algorithm

Birkhoff representation theorem states that any jrm is equal to the joinof the jims contained in it. Let S={1₀, 1₁, . . . 1_(n)} be a subset ofa lattice L. Then the jims of c=meet(S) are given by:J(c)=∩_(1∈S) J(s)=J(1₀)∩J(1₁)∩Y J(1_(n))so we have:c=meet(S)=join(J(1₀)∩J(1₁)∩ . . . J(1_(n)))

The meet operation thus reduces to a combination of set intersectionoperations and a join operation. The set intersection operation isstandard, the join algorithms are given above.

Appendix B Cellular Lattice Constructor Algorithm

A cellular lattice is constructed by making copies of a template andgluing the copies together. The copies are glued together by specifyingwhich members in one copy are the same as members in another copy. Themembers which are thus glued together are the atoms of the template, themembers of the template which form the upper cover of the bottom member.

The input to the cellular lattice constructor consists of:

-   -   template: any lattice    -   copy_ct: the number of copies to be made of the template    -   glue_ids: an array of arbitrary identifiers. The number of        entries in this array must be equal to the number of atoms in        the template times copy_ct

The algorithm requires 3 auxiliary data structures:

-   glue_map: a map from the externally defined glue_id to the id of a    member in the result-   template_map: a map from template member ids to result member ids.-   lower_cover_stack: a stack containing lower cover sets

The top level of the algorithm is:

-   -   1. initialize glue_map to empty    -   2. create a top member for the result    -   3. for i=0 to copy_ct:        -   initialize template_map to empty.        -   perform a depth first traversal of the template.    -   4. compute the minimal upper bound of the top of the result, as        in A.1.2 above.    -   5. if the top of the result is not already in the graph, insert        it below the minimal upper bound.

The actions performed in the traversal are:

-   previsit action:    -   if the template member is not an atom, create an empty lower        cover set for the copy of the template member and push it onto        lower_cover_stack-   link action:    -   get the result member corresponding to the template member at        the lesser end of the link using template_map. This look up will        always succeed because the depth first traversal ensures that        the postvisit action of the lesser member will always occur        before the member appears as the lesser member in a link.    -   insert the result member in the cover set that is on the top of        lower_cover_stack-   postvisit action:    -   if the current template member is a atom:        -   set glue_id equal to the next entry from glue ids and            increment the glue_ids counter        -   look up glue_id in the glue_map. If an entry exists, glue_id            has been used before, get the result id associated with it            by the map. Otherwise, the glue_id as not been used before,            create a new result member and insert the (glue_id, result            id) pair in the map.        -   insert the (current template id, result id) in template_map    -   if the current template member is not an atom:        -   Check to see if any members already in the block have a            lower cover identical to what is currently on the top of            lower_cover_stack. If there are any such members, they must            be in the upper cover of every member of the cover on the            stack, hence they must be in the upper cover of the first            member. Check the lower cover of every member of the upper            cover of the first member of the cover on the stack.        -   If a member with an identical lower cover already exists, it            is the copy of the current template member. Otherwise,            create a new result member and link it to the members of the            top of lower_cover_stack        -   insert the (current template id, result id) in template_map        -   pop lower_cover_stack    -   if the current template member is the top of the template,        insert result id into the lower cover of the top of the result

1. A computer-implemented method of representing data on a computer as acollection of finite distributive lattices for facilitating informationretrieval in response to a query, comprising the steps of: selecting oneor more entity types within an application, each entity type being asingle entity type; constructing a distinct table to represent eachentity type selected in said selecting step, such that there is aone-to-one correspondence between respective tables and entity types;for each table executing steps of constructing a column in the table fora respective attribute of the entity type, such that there is aone-to-one correspondence between columns and attributes of the entitytype; constructing a row in the table for each entity of the entitytype, such that there is a one-to-one correspondence between rows andentities; entering attribute data into rows of the table; specifying arow graph which represents an externally specified ordering relationshipbetween the rows of the table; and defining a finite distributivelattice (FDL) from the row graph to have a member for each row and eachdistinct combination of the rows of the table, wherein two combinationsof rows are distinct if they do not represent a same orderingrelationship.
 2. The method according to claim 1, wherein the tableincludes one row for each primary entity of the entity type.
 3. Themethod according to claim 1, wherein a first entity is included in asecond entity if and only if there is a path in the graph from a nodecorresponding to the first entity to a node corresponding to the secondentity.
 4. The method according to claim 1, wherein the orderingrelationship of the rows of the table comprises a partially orderedrelationship.
 5. The method according to claim 1, further comprising thestep of: querying the row graph to determine distinct combinations ofthe rows of the table, wherein two different combinations of members aredistinct if they do not represent a same ordering relationship.
 6. Themethod according to claim 1, further comprising the step of: executing acommand indicative of an operation a₁≦a₂ to determine if and only ifthere is a path in the graph from a₁ to a₂, where a₁ and a₂ are nodes inthe row graph.
 7. The method according to claim 1, further comprisingthe step of: executing a command indicative of an operation DOWN(a) inwhich a resultant table and graph is returned including all rows of thetable and nodes and links of the row graph which are less than or equalto “a”, where “a” is a specified node in the row graph.
 8. The methodaccording to claim 1, wherein the attribute data comprises at least oneof simulation data, spatial data, object-orientated data, and relationaldata.
 9. The method according to claim 1, further comprising the stepof: executing a command indicative of an operation JOIN(1 ₁, 1 ₂, . . .1 _(n)) to determine a smallest member of the FDL which is greater thanor equal to the inputs 1 ₁, 1 ₂, . . . 1 _(n).
 10. The method accordingto claim 1, further comprising the step of: executing a commandindicative of an operation MEET(1 ₁, 1 ₂, . . . 1 _(n)) to determine alargest member of the FDL which is less than or equal to the inputs 1 ₁,1 ₂, . . . 1 _(n).
 11. The method according to claim 1, wherein any nodein the row graph below and connected to another node is included in theother node.
 12. The method according to claim 1, further comprising thestep of: executing a command indicative of the operation n-ary Cartesianproduct L1×L2× . . . ×Ln, to generate a resultant FDL with columns equalto the disjoint union of the columns of L1, L2, . . . Ln, where L1, L2,. . . Ln represents any collection of FDLs, wherein the row-graph is anypartial order.
 13. The method according to claim 1, further comprisingthe step of: executing a command indicative of the operation ofSELECTION(L, c) to generate a resultant FDL comprising the table rowsthat satisfy c, the row graph that satisfy c, and all columns of L,where L is a FDL and c is a condition on the rows of L.
 14. The methodaccording to claim 1, further comprising the step of: executing acommand indicative of the operation PROJECTION(L, c) to generate aresultant FDL comprising all columns of L that satisfy c, and all tablerows and the entire graph of L, where L is a FDL and c is a condition onthe columns of L.
 15. The method according to claim 1, furthercomprising the step of: executing a command indicative of the operationUNION(L1, L2) to generate a resultant FDL containing the rows of L1 andthe rows of L2, a row graph which is the reflexive, transitive reductionof the union of the row graphs of L1 and L2, and the columns of L1,where L1 and L2 are FDLs with the same columns.
 16. The method accordingto claim 1, further comprising the step of: executing a commandindicative of the operation INTERSECTION(L1, L2) to generate a resultantFDL containing those rows of L1 which are the same as rows in L2, a rowgraph which is the reflexive, transitive reduction of the intersectionof the row graphs of L1 and L2, and the columns of L1, where L1 and L2are FDLs with the same columns.
 17. The method according to claim 1,further comprising the step of: executing a command indicative ofRENAME(L, new₁₃ name) to change the name of L to new₁₃ name, where L isa FDL and new₁₃ name is a name.
 18. The method according to claim 1,further comprising the step of: executing a command indicative of theoperator CREATE_JIM(L) to create a new row in the table of L and a newnode in the row graph of L, where L is a FDL.
 19. The method accordingto claim 1, further comprising the step of: executing a commandindicative of DELETE_JIM(L, JIM_ID) to remove a row from the table of Land to remove the corresponding node and any connecting links in the rowgraph of L, where L is a FDL and JIM_ID identifies a row in L.
 20. Themethod according to claim 1, further comprising the step of: executing acommand indicative of the operator CREATE_LINK(L, LESSER_ID, GREATER_ID)to create a link between the node corresponding to LESSER_ID and thenode corresponding to GREATER_ID in the row graph of L, where L is a FDLand LESSER_ID and GREATER_ID identify the lesser and greater rows,respectively, of the ordering relationship represented by the link. 21.The method according to claim 1, further comprising the step of:executing a command indicative of the operator DELETE_LINK(L, LESSER_ID,GREATER_ID) to remove a link between the node corresponding to LESSER_IDand the node corresponding to GREATER_ID in the row graph of L, where Lis a FDL and LESSER_ID and GREATER_ID identify the lesser and greaterrows, respectively, of the ordering relationship represented by thelink.
 22. A computer implemented data model for facilitating informationretrieval via a query, comprising: a first table and other tablesrespectively configured to represent a single entity type from a groupof entity types such that there is a one-to-one correspondence betweenrespective tables and entity types, said first table having a column fora respective attribute of the entity type such that there is aone-to-one correspondence between columns and respective attributes ofthe entity type, and a different row for each entity of the entity typessuch that there is a one-to-one correspondence between rows andrespective entities, wherein each row is externally specified andincludes attribute data for an entity that corresponds with the row; arow graph which represents an ordering relationship between the rows ofthe first table; and a finite distributive lattice (FDL) defined fromthe first table to have distinct combinations of the rows of the firsttable, wherein two different combinations of members are distinct ifthey do not represent a same ordering relationship.
 23. The data modelaccording to claim 22, wherein the first table includes one row for eachprimary entity of the entity type.
 24. The data model according to claim22, wherein a first entity is included in a second entity if and only ifthere is a path in the graph from a node corresponding to the firstentity to a node corresponding to the second entity.
 25. The data modelaccording to claim 22, wherein the ordering relationship of the rows ofthe first table comprises a partially ordered relationship.
 26. The datamodel according to claim 22, wherein distinct combination of the rows ofthe first table are determined by querying the row graph, and whereintwo different combinations of members are distinct if they do notrepresent a same ordering relationship.
 27. The data model according toclaim 22, further comprising: a command indicative of an operation a₁≦a₂to determine if and only if there is a path in the graph from a₁ to a₂,where a₁ and a₂ are nodes in the row graph.
 28. The data model accordingto claim 22, further comprising: a command indicative of an operationDOWN(a) in which a resultant table and graph is returned including allrows of the first table and nodes and links of the row graph which areless than or equal to “a”, where “a” is a specified node in the rowgraph.
 29. The data model according to claim 22, wherein the attributedata comprises at least one of simulation data, spatial data,object-orientated data, and relational data.
 30. The data modelaccording to claim 22, further comprising: a command indicative of anoperation JOIN(1 ₁, 1 ₂, . . . 1 _(n)) to determine a smallest member ofthe FDL which is greater than or equal to the inputs 1 ₁, 1 ₂, . . . 1_(n).
 31. The data model according to claim 22, further comprising: acommand indicative of an operation MEET(1 ₁, 1 ₂, . . . 1 _(n)) todetermine a largest member of the FDL which is less than or equal to theinputs 1 ₁, 1 ₂, . . . 1 _(n).
 32. The data model according to claim 22,wherein any node in the row graph below and connected to another node isincluded in the other node.
 33. The data model according to claim 22,further comprising: a command indicative of the operation n-aryCartesian product L1×L2× . . . ×Ln, to generate a resultant FDL withcolumns equal to the disjoint union of the columns of L1, L2, . . . Ln,where L1, L2, Ln represents any collection of FDLs, wherein therow-graph is any partial order.
 34. The data model according to claim22, further comprising: a command indicative of the operation ofSELECTION(L, c) to generate a resultant FDL comprising the table rows ofL that satisfy c, the row graph that satisfy c, and all columns of L,where L is a FDL and c is a condition on the rows of L.
 35. The datamodel according to claim 22, further comprising: a command indicative ofthe operation PROJECTION(L, c) to generate a resultant FDL comprisingall columns of L that satisfy c, and all table rows and the entire graphof L, where L is a FDL and c is a condition on the columns of L.
 36. Thedata model according to claim 22, further comprising: a commandindicative of the operation UNION(L1, L2) to generate a resultant FDLcontaining the rows of L1 and the rows of L2, a row graph which is thereflexive, transitive reduction of the union of the row graphs if L1 andL2, and columns of L1, where L1 and L2 are FDLs with the same columns.37. The data model according to claim 22, further comprising: a commandindicative of the operation INTERSECTION(L1, L2) to generate a resultantFDL containing those rows of L1 which are the same as rows in L2, a rowgraph which is the reflexive, transitive reduction of the intersectionof the row graphs of L1 and L2, and the columns of L1, where L1 and L2are FDLs with the same columns.
 38. The data model according to claim22, further comprising: a command indicative of RENAME(L, new_name) tochange the name of L to new_name, where L is a FDL and new_name is aname.
 39. The data model according to claim 22, further comprising: acommand indicative of the operator CREATE_JIM(L) to create a new row inthe table of L and a new node in the row graph of L, where L is a FDL.40. The data model according to claim 22, further comprising: a commandindicative of DELETE_JIM(L, JIM_ID) to remove a row from the table of Land to remove the corresponding node and any connecting links in the rowgraph of L, where L is a FDL and JIM_ID identifies a row in L.
 41. Thedata model according to claim 22, further comprising: a commandindicative of the operator CREATE_LINK(L, LESSER_ID, GREATER_ID) tocreate a link between the node corresponding to LESSER_ID and the nodecorresponding to GREATER_ID in the row graph of L, where L is a FDL andLESSER_ID and GREATER_ID identify the lesser and greater rows,respectively, of the ordering relationship represented by the link. 42.The data model according to claim 22, further comprising: a commandindicative of the operator DELETE_LINK(L, LESSER_ID, GREATER_ID) toremove a link between the node corresponding to LESSER_ID and the nodecorresponding to GREATER_ID in the row graph of L, where L is a FDL andLESSER_ID and GREATER_ID identify the lesser and greater rows,respectively, of the ordering relationship represented by the link. 43.A computer-implemented method of representing data on a computer as acollection of finite sheaves for facilitating information retrieval inresponse to a query, comprising the steps of: selecting one or moreentity types within an application, each entity type being a singleentity type; constructing a distinct table to represent an entity typeselected in said selecting step, such that there is a one-to-onecorrespondence between respective tables and entity types; for eachtable executing steps of: selecting another table, hereafter referred toas the schema table of the current table; constructing a column in thecurrent table for each row of the respective schema table, such thatthere is a one-to-one correspondence between columns in the currenttable and rows in the schema table; interpreting each column of thetable as an attribute of the associated entity type; interpreting a rowgraph of the schema table as a column graph of the current table, saidcolumn graph representing an ordering relationship between the columnsof the current table; constructing a row in the current table for eachentity of the associated entity type, such that there is a one-to-onecorrespondence between rows and entities; entering attribute data intorows of the current table; specifying a row graph which represents anexternally specified ordering relationship between the rows of thecurrent table; defining a finite distributive lattice (FDL) from the rowgraph to have a member for each row and each distinct combination of therows of the current table, wherein two combinations of rows are distinctif they do not represent a same ordering relationship; and defining afinite sheaf from the table, row graph and column graph.
 44. The methodaccording to claim 43, wherein a first entity is included in a secondentity if and only if there is a path in the graph from a nodecorresponding to the first entity to a node corresponding to the secondentity.
 45. The method according to claim 43, wherein the orderingrelationship of the rows of the first table comprises a partiallyordered relationship.
 46. The method according to claim 43, furthercomprising the step of: querying the row graph to determine distinctcombinations of the rows of the first table, wherein two differentcombinations of members are distinct if they do not represent a sameordering relationship.
 47. The method according to claim 43, furthercomprising the step of: executing a command indicative of an operationa1<a2 to determine if and only if there is a path in the graph from a1to a2, where a1 and a2 are nodes in the row graph.
 48. The methodaccording to claim 43, further comprising the step of: executing acommand indicative of an operation DOWN(a) in which a resultant tableand graph is returned including all rows of the first table and nodesand links of the row graph which are less than or equal to “a”, where“a” is a specified node in the row graph.
 49. The method according toclaim 43, wherein the attribute data comprises at least one ofsimulation data, spatial data, object-orientated data, and relationaldata.
 50. The method according to claim 43, further comprising the stepof: executing a command indicative of an operation JOIN(11, 12, . . .1n) to determine a smallest member of the sheaf which is greater than orequal to the inputs 11, 12, . . . 1n.
 51. The method according to claim43, further comprising the step of executing a command indicative of anoperation MEET(11, 12, . . . 1n) to determine a largest member of thesheaf which is less than or equal to the inputs 11, 12, . . . 1n. 52.The method according to claim 43, further comprising the step of:executing a command indicative of an operation EXP(L) to generate aresultant sheaf with a column graph corresponding to the row graph of L,where L is a sheaf.
 53. The method according to claim 43, furthercomprising the step of: executing a command indicative of an operationLOG(L) to determine the schema sheaf of L, where L is a sheaf.
 54. Themethod according to claim 43, further comprising the step of: executinga command indicative of an operation RESTRICT L TO S to determine aprojection of the sheaf onto columns in the down set of S, where S is amember of the schema of L and L is a sheaf.
 55. The method according toclaim 43, wherein any node in the row graph below and connected toanother node is included in the other node.
 56. The method according toclaim 43, further comprising the step of: executing a command indicativeof the operation n-ary Cartesian product L1×L2× . . . ×Ln, to generate aresultant sheaf with a schema sheaf equal to the union of the schema ofL1, L2, . . . Ln, where L1, L2, . . . Ln represents any collection ofsheaves.
 57. The method according to claim 43, further comprising thestep of: executing a command indicative of the operation of SELECTION(L,c) to generate a resultant sheaf comprising the table rows that satisfyc, the row graph that satisfy c, and the entire column graph and allcolumns of L, where L is a sheaf and c is a condition on the rows of L.58. The method according to claim 43, further comprising the step of:executing a command indicative of the operation PROJECTION(L, c) togenerate a resultant sheaf comprising the column graph and columns of Lthat satisfy c, and all table rows, and the entire row graph of L, whereL is a sheaf and c is a condition on the columns of L.
 59. The methodaccording to claim 43, further comprising the step of: executing acommand indicative of the operation UNION(L1, L2) to generate aresultant sheaf containing the rows of L1 and the rows of L2, a rowgraph which is the reflexive, transitive reduction of the union of therow graphs of L2 and L2, and the column graph of L1, where L1 and L2 aresheaves with the same column graph.
 60. The method according to claim43, further comprising the step of: executing a command indicative ofthe operation INTERSECTION(L1, L2) to generate a resultant sheafcontaining those rows of L1 which are the same as rows in L2, a rowgraph which is the reflexive, transitive reduction of the intersectionof the row graphs of L1 and L2, and the column graph of L1, where L1 andL2 are sheaves with the same column graph.
 61. The method according toclaim 43, further comprising the step of: executing a command indicativeof RENAME(L, new_name) to change the name of L to new_name, where L is asheaf and new_name is a name.
 62. The method according to claim 43,further comprising the step of: executing a command indicative of theoperator CREATE_JIM(L) to create a new row in the table of L and a newnode in the row graph of L, where L is a sheaf.
 63. The method accordingto claim 43, further comprising the step of: executing a commandindicative of DELETE_JIM(L, JIM_ID) to remove a row from the table of Land to remove the corresponding node and any connecting links in the rowgraph of L, where L is a sheaf and JIM_ID identifies a row in L.
 64. Themethod according to claim 43, further comprising the step of: executinga command indicative of the operator CREATE_LINK(L, LESSER_ID,GREATER_ID) to create a link between the node corresponding to LESSER_IDand the node corresponding to GREATER_ID in the row graph of L, where Lis a sheaf and LESSER_ID and GREATER_ID identify the lesser and greaterrows, respectively, of the ordering relationship represented by thelink.
 65. The method according to claim 43, further comprising the stepof: executing a command indicative of the operator DELETE_LINK(L,LESSER_ID, GREATER_ID) to remove a link between the node correspondingto LESSER_ID and the node corresponding to GREATER_ID in the row graphof L, where L is a sheaf and LESSER_ID and GREATER_ID identify thelesser and greater rows, respectively, of the ordering relationshiprepresented by the link.
 66. A data model encoded on a computer-readablemedium as a collection of finite sheaves for facilitating informationretrieval in response to a query, comprising: a first table and othertables respectively configured to represent a single entity type from agroup of entity types, such that there is a one-to-one correspondencebetween respective tables and entity types, said first table having: anassociation with a second table, hereafter referred to as the schematable of the first table; a column for each row of the respective schematable, such that there is a one-to-one correspondence between columns inthe first table and rows in the schema table; each said columncorresponding to an attribute of the entity type associated with thefirst table; a column graph defined to be a row graph of the respectiveschema table, said column graph representing an ordering relationshipbetween the columns of the current table; a row for each entity of theassociated entity type, such that there is a one-to-one correspondencebetween rows and entities; attribute data included in the rows; a rowgraph which represents an externally specified ordering relationshipbetween the rows of the first table; a finite distributive lattice (FDL)defined from the row graph to have a member for each row and eachdistinct combination of the rows of the first table, wherein twocombinations of rows are distinct if they do not represent a sameordering relationship; and a finite sheaf corresponding to the table,row graph and column graph.
 67. The data model according to claim 66,wherein a first entity is included in a second entity if and only ifthere is a path in the graph from a node corresponding to the firstentity to a node corresponding to the second entity.
 68. The data modelaccording to claim 66, wherein the ordering relationship of the rows ofthe first table comprises a partially ordered relationship.
 69. The datamodel according to claim 66, wherein distinct combination of the rows ofthe first table are determined by querying the row graph, and whereintwo different combinations of members are distinct if they do notrepresent a same ordering relationship.
 70. The data model according toclaim 66, further comprising: a command indicative of an operation a1<a2to determine if and only if there is a path in the graph from a1 to a2,where a1 and a2 are nodes in the row graph.
 71. The data model accordingto claim 66, further comprising: a command indicative of an operationDOWN(a) in which a resultant table and graph is returned including allrows of the first table and nodes and links of the row graph which areless than or equal to “a”, where “a” is a specified node in the rowgraph.
 72. The data model according to claim 66, wherein the attributedata comprises at least one of simulation data, spatial data,object-orientated data, and relational data.
 73. The data modelaccording to claim 66, further comprising: a command indicative of anoperation JOIN(l1, l2, . . . ln) to determine a smallest member of thesheaf which is greater than or equal to the inputs l1, l2, . . . ln. 74.The data model according to claim 66, further comprising: a commandindicative of an operation MEET(l1, l2, . . . ln) to determine a largestmember of the sheaf which is less than or equal to the inputs l1, l2, .. . ln.
 75. The data model according to claim 66, further comprising: acommand indicative of an operation EXP(L) to generate a resultant sheafwith a column graph corresponding to the row graph of L, where L is asheaf.
 76. The data model according to claim 66, further comprising: acommand indicative of an operation LOG(L) to determine the schema sheafof L, where L is a sheaf.
 77. The data model according to claim 66,further comprising: a command indicative of an operation RESTRICT L TO Sto determine a projection of L onto columns in the down set of S, whereS is a member of the schema of L and L is a sheaf.
 78. The data modelaccording to claim 66, wherein any node in the row graph below andconnected to another node is included in the other node.
 79. The datamodel according to claim 66, further comprising: a command indicative ofthe operation n-ary Cartesian product L1×L2× . . . ×Ln, to generate aresultant sheaf with a schema sheaf equal to the union of the schema ofL1, L2, . . . Ln, where L1, L2, . . . Ln represents any collection ofsheaves.
 80. The data model according to claim 66, further comprising: acommand indicative of the operation of SELECTION(L, c) to generate aresultant sheaf comprising the table rows that satisfy c, the row graphthat satisfy c, and the entire column graph and all columns of L, whereL is a sheaf and c is a condition on the rows of L.
 81. The data modelaccording to claim 66, further comprising: a command indicative of theoperation PROJECTION(L, c) to generate a resultant sheaf comprising thecolumn graph and columns of L that satisfy c, and all table rows, andthe entire row graph of L, where L is a sheaf and c is a condition onthe columns of L.
 82. The data model according to claim 66, furthercomprising: a command indicative of the operation UNION(L1, L2) togenerate a resultant sheaf containing the rows of L1 and the rows of L2,a row graph which is the reflexive, transitive reduction of the union ofthe row graphs of L1 and L2, where L1 and L2 are sheaves with the samecolumn graph.
 83. The data model according to claim 66, furthercomprising: a command indicative of the operation INTERSECTION(L1, L2)to generate a resultant sheaf containing those rows of L1 which are thesame as rows in L2, a row graph which is the reflexive, transitivereduction of the intersection of the row graphs of L1 and L2, and thecolumn graph of L1, where L1 and L2 are sheaves with the same columngraph.
 84. The data model according to claim 66, further comprising: acommand indicative of RENAME(L, new_name) to change the name of L tonew_name, where L is a sheaf and new_name is a name.
 85. The data modelaccording to claim 66, further comprising: a command indicative of theoperator CREATE_JIM(L) to create a new row in the table of L and a newnode in the row graph of L, where L is a sheaf.
 86. The data modelaccording to claim 66, further comprising: a command indicative ofDELETE_JIM(L, JIM_ID) to remove a row from the table of L and to removethe corresponding node and any connecting links in the row graph of L,where L is a sheaf and JIM_ID identifies a row in L.
 87. The data modelaccording to claim 66, further comprising: a command indicative of theoperator CREATE_LINK(L, LESSER_ID, GREATER_ID) to create a link betweenthe node corresponding to LESSER_ID and the node corresponding toGREATER_ID in the row graph of L, where L is a sheaf and LESSER_ID andGREATER_ID identify the lesser and greater rows, respectively, of theordering relationship represented by the link.
 88. The data modelaccording to claim 66, further comprising: a command indicative of theoperator DELETE_LINK(L, LESSER_ID, GREATER_ID) to remove a link betweenthe node corresponding to LESSER_ID and the node corresponding toGREATER_ID in the row graph of L, where L is a sheaf and LESSER_ID andGREATER_ID identify the lesser and greater rows, respectively, of theordering relationship represented by the link.